Tractability properties of the weighted star discrepancy

نویسندگان

  • Aicke Hinrichs
  • Friedrich Pillichshammer
  • Wolfgang Ch. Schmid
چکیده

Tractability properties of various notions of discrepancy have been intensively studied in the last decade. In this paper we consider the so-called weighted star discrepancy which was introduced by Sloan and Woźniakowski. We show that under a very mild condition on the weights one can obtain tractability with s-exponent zero (s is the dimension of the point set). In the case of product weights we give a condition such that the weighted star discrepancy is even strongly tractable. Furthermore, we give a lower bound for the weighted star discrepancy for a large class of weights. This bound shows that for such weights one cannot obtain strong tractability.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Existence and construction of shifted lattice rules with an arbitrary number of points and bounded weighted star discrepancy for general decreasing weights

We study the problem of constructing shifted rank-1 lattice rules for the approximation of high-dimensional integrals with a low weighted star discrepancy, for classes of functions having bounded weighted variation, where the weighted variation is defined as the weighted sum of Hardy-Krause variations over all lower dimensional projections of the integrand. Under general conditions on the weigh...

متن کامل

Good lattice rules based on the general weighted star discrepancy

We study the problem of constructing rank-1 lattice rules which have good bounds on the “weighted star discrepancy”. Here the non-negative weights are general weights rather than the product weights considered in most earlier works. In order to show the existence of such good lattice rules, we use an averaging argument, and a similar argument is used later to prove that these lattice rules may ...

متن کامل

Bounds for the weighted Lp discrepancy and tractability of integration

Quite recently Sloan and Woźniakowski [4] introduced a new notion of discrepancy, the so called weighted L discrepancy of points in the d-dimensional unit cube for a sequence γ = (γ1, γ2, . . .) of weights. In this paper we prove a nice formula for the weighted L discrepancy for even p. We use this formula to derive an upper bound for the average weighted L discrepancy. This bound enables us to...

متن کامل

Construction Algorithms for Digital Nets with Low Weighted Star Discrepancy

We introduce a new construction method for digital nets which yield point sets in the s-dimensional unit cube with small star discrepancy. The digital nets are constructed using polynomials over finite fields. It has long been known that there exist polynomials which yield point sets with small (unweighted) star discrepancy. This result was obtained by Niederreiter by the means of averaging ove...

متن کامل

Strong tractability of multivariate integration using quasi-Monte Carlo algorithms

We study quasi–Monte Carlo algorithms based on low discrepancy sequences for multivariate integration. We consider the problem of how the minimal number of function evaluations needed to reduce the worst-case error from its initial error by a factor of ε depends on ε−1 and the dimension s. Strong tractability means that it does not depend on s and is bounded by a polynomial in ε−1. The least po...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Complexity

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2008